Markovian traffic equilibrium

Markovian traffic equilibrium

We analyze a stochastic dynamic programming model for traffic equilibrium on networks. In this model passengers move towards their destinations by a sequential process of arc selection based on a discrete choice model at every intermediate node in their trip. Route selection is therefore the outcome of a sequential process of arc choices while network flows correspond to the invariant measures ...

Modeling Local Area Network Traffic with Markovian Traffic Models

In this work, we assess the suitability of some Markovian models and their associated fitting procedures to describe IP traffic exhibiting long-range dependence. We resort to traffic traces measured at the Institute of Telecommunications – Aveiro Pole. The models under analysis are special cases of Markov Modulated Poisson Processes (MMPPs): 2-MMPP, CMPP (Circulant Markov Poisson Process) and (...

Traffic Network Equilibrium

Dynamic Traffic Network Equilibrium System

We discuss the dynamic traffic network equilibrium system problem.We introduce the equilibrium definition based on Wardrop’s principles when there are some internal relationships between different kinds of goods which transported through the same traffic network. Moreover, we also prove that the equilibrium conditions of this problem can be equivalently expressed as a system of evolutionary var...

Constrained traffic equilibrium in routing

Use qij to denote the (i; j)-entry of the matrix Q (i; j = 1; 2). Then (Q) reads as (Q) = 0(1 + p 05)r 0 2 0(2 0 p 05)r + (1 + p 05) 2r + (1 0 p 05) 0(1 + p 05)r 0 2 (2) where r = (01+ p 05)q 11 0(2+ p 05)q 12 +2q 21 + (01+ p 05)q 22 : (3) Because any stabilizing controller can be obtained from the (2, 1)-and (2, 2)-entries of (2), we are interested in the set of r's of (3), that is, the ideal ...